Recognizing multiple objects based on co-occurrence of categories
نویسندگان
چکیده
منابع مشابه
Recognizing multiple objects based on co-occurrence of categories
Most previous methods for generic object recognition explicitly or implicitly assume that an image contains objects from a single category, although objects from multiple categories often appear together in an image. In this paper, we present a novel method for object recognition that explicitly deals with objects of multiple categories coexisting in an image. Furthermore, our proposed method a...
متن کاملRecognizing Multiple Objects via Regression Incorporating the Co-occurrence of Categories
Most previous methods for generic object recognition explicitly or implicitly assume that an image contains objects from a single category, although objects from multiple categories often appear together in an image. In this paper, we present a novel method for object recognition that explicitly deals with objects of multiple categories coexisting in an image. Furthermore, our proposed method a...
متن کاملGorenstein projective objects in Abelian categories
Let $mathcal {A}$ be an abelian category with enough projective objects and $mathcal {X}$ be a full subcategory of $mathcal {A}$. We define Gorenstein projective objects with respect to $mathcal {X}$ and $mathcal{Y}_{mathcal{X}}$, respectively, where $mathcal{Y}_{mathcal{X}}$=${ Yin Ch(mathcal {A})| Y$ is acyclic and $Z_{n}Yinmathcal{X}}$. We point out that under certain hypotheses, these two G...
متن کاملRecognizing objects on cluttered backgrounds
This paper deals with recognition of known 3-D objects in different orientations on cluttered backgrounds. As a recognition technique we apply support vector machines (SVMs). To cope with the cluttered background a tree structure of masks is introduced for each object. SVMs are then computed by masking the training sets with the appropriate masks. Oneand two-class SVMs are combined in the recog...
متن کاملClustering Co-occurrence Graph based on Transitivity
Word co-occurrences form a graph, regarding words as nodes and co-occurrence relations as branches. Thus, a co-occurrence graph can be constructed by co-occurrence relations in a corpus. This paper discusses a clustering method of the co-occurrence graph, the decomposition of the graph, from a graph-theoretical viewpoint. Since one of the applications for the clustering results is the ambiguity...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Progress in Informatics
سال: 2010
ISSN: 1349-8614,1349-8606
DOI: 10.2201/niipi.2010.7.6